Hyperidentities in Associative Graph Algebras
نویسنده
چکیده
Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity s ≈ t if the corresponding graph algebra A(G) satisfies s ≈ t. A graph G is called associative if the corresponding graph algebra A(G) satisfies the equation (xy)z ≈ x(yz). An identity s ≈ t of terms s and t of any type τ is called a hyperidentity of an algebra A if whenever the operation symbols occurring in s and t are replaced by any term operations of A of the appropriate arity, the resulting identities hold in A. In this paper we characterize associative graph algebras, identities in associative graph algebras and hyperidentities in associative graph algebras.
منابع مشابه
Hyperidentities in (xy)x ≈ X(yy) Graph Algebras of Type (2, 0) Hyperidentities in (xy)x ≈ X(yy) Graph Algebras of Type (2, 0)
Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2, 0). We say that a graph G satisfies an identity s ≈ t if the corresponding graph algebra A(G) satisfies s ≈ t. A graph G = (V, E) is called an (xy)x ≈ x(yy) graph if the graph algebra A(G) satisfies the equation (xy)x ≈ x(yy). An identity s ≈ t of terms s and t of any ...
متن کاملUltra and Involution Ideals in $BCK$-algebras
In this paper, we define the notions of ultra and involution ideals in $BCK$-algebras. Then we get the relation among them and other ideals as (positive) implicative, associative, commutative and prime ideals. Specially, we show that in a bounded implicative $BCK$-algebra, any involution ideal is a positive implicative ideal and in a bounded positive implicative lower $BCK$-semilattice, the not...
متن کاملBinary Representations of Algebras with at Most Two Binary Operations: a Cayley Theorem for Distributive Lattices
The notion of binary representation of algebras with at most two binary operations is introduced in this paper, and the binary version of Cayley theorem for distributive lattices is given by hyperidentities. In particular, we get the binary version of Cayley theorem for DeMorgan and Boolean algebras.
متن کاملNILPOTENT GRAPHS OF MATRIX ALGEBRAS
Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...
متن کاملThe Strong Amalgamation Property and (effective) Codescent Morphisms
Codescent morphisms are described in regular categories which satisfy the so-called strong amalgamation property. Among varieties of universal algebras possessing this property are, as is known, categories of groups, not necessarily associative rings, M -sets (for a monoid M), Lie algebras (over a field), quasi-groups, commutative quasi-groups, Steiner quasi-groups, medial quasigroups, semilatt...
متن کامل